Depth-First Search

QUIZ QUESTION: :

On which steps of its search would the DFS algorithm reach the nodes labelled A, B, and C?

ANSWER CHOICES:

A

B

C

Node	Expansion Order
20
28
18
14
32
25

SOLUTION:

Node	Expansion Order
20	A
18	B
32	C

Is the depth-first search algorithm complete? Optimal? Efficient?

Complete

Optimal

Efficient

Neither

SOLUTION:

• Neither